Complex Convexity

Complex Convexity

Convexity in complex networks

Metric graph properties lie in the heart of the analysis of complex networks, while in this paper we study their convexity through mathematical definition of a convex subgraph. A subgraph is convex if every geodesic path between the nodes of the subgraph lies entirely within the subgraph. According to our perception of convexity, convex network is such in which every connected subset of nodes i...

On convexity in complex networks

Lovro Šubelj University of Ljubljana, Faculty of Computer and Information Science Ljubljana, Slovenia [email protected] Tilen Marc Institute of Mathematics, Physics and Mechanics Ljubljana, Slovenia [email protected] Metric graph theory is a study of geometric properties of graphs based on a notion of the shortest path between the nodes defined as the path through the smallest number ...

Compact Convex Sets and Complex Convexity

We construct a quasi-Banach space which cannot be given an equivalent plurisubharmonic quasi-norm, but such that it has a quotient by a onedimensional space which is a Banach space. We then use this example to construct a compact convex set in a quasi-Banach space which cannot be atfinely embedded into the space L0 of all measurable functions.

Near convexity, metric convexity, and convexity

It is shown that a subset of a uniformly convex normed space is nearly convex if and only if its closure is convex. Also, a normed space satisfying a mild completeness property is strictly convex if and only if every metrically convex subset is convex. 1 Classical and constructive mathematics The arguments in this paper conform to constructive mathematics in the sense of Errett Bishop. This mea...